Time After Time: Notes on Delays In Spiking Neural P Systems

Spiking Neural P systems, SNP systems for short, are biologically inspired computing devices based on how neurons perform computations. SNP systems use only one type of symbol, the spike, in the computations. Information is encoded in the time differences of spikes or the multiplicity of spikes produced at certain times. SNP systems with delays (associated with rules) and those without delays are two of several Turing complete SNP system variants in literature. In this work we investigate how restricted forms of SNP systems with delays can be simulated by SNP systems without delays. We show the simulations for the following spike routing constructs: sequential, iteration, join, and split.Comment: 11 pages, 9 figures, 4 lemmas, 1 theorem, preprint of Workshop on Computation: Theory and Practice 2012 at DLSU, Manila together with UP Diliman, DLSU, Tokyo Institute of Technology, and Osaka universit

Computing with cells: membrane systems - some complexity issues.

Membrane computing is a branch of natural computing which abstracts computing models from the structure and the functioning of the living cell. The main ingredients of membrane systems, called P systems, are (i) the membrane structure, which consists of a hierarchical arrangements of membranes which delimit compartments where (ii) multisets of symbols, called objects, evolve according to (iii) sets of rules which are localised and associated with compartments. By using the rules in a nondeterministic/deterministic maximally parallel manner, transitions between the system configurations can be obtained. A sequence of transitions is a computation of how the system is evolving. Various ways of controlling the transfer of objects from one membrane to another and applying the rules, as well as possibilities to dissolve, divide or create membranes have been studied. Membrane systems have a great potential for implementing massively concurrent systems in an efficient way that would allow us to solve currently intractable problems once future biotechnology gives way to a practical bio-realization. In this paper we survey some interesting and fundamental complexity issues such as universality vs. nonuniversality, determinism vs. nondeterminism, membrane and alphabet size hierarchies, characterizations of context-sensitive languages and other language classes and various notions of parallelism

Bounded Languages Meet Cellular Automata with Sparse Communication

Cellular automata are one-dimensional arrays of interconnected interacting finite automata. We investigate one of the weakest classes, the real-time one-way cellular automata, and impose an additional restriction on their inter-cell communication by bounding the number of allowed uses of the links between cells. Moreover, we consider the devices as acceptors for bounded languages in order to explore the borderline at which non-trivial decidability problems of cellular automata classes become decidable. It is shown that even devices with drastically reduced communication, that is, each two neighboring cells may communicate only constantly often, accept bounded languages that are not semilinear. If the number of communications is at least logarithmic in the length of the input, several problems are undecidable. The same result is obtained for classes where the total number of communications during a computation is linearly bounded

Supersymmetric free-damped oscillators: Adaptive observer estimation of the Riccati parameter

A supersymmetric class of free damped oscillators with three parameters has been obtained in 1998 by Rosu and Reyes through the factorization of the Newton equation. The supplementary parameter is the integration constant of the general Riccati solution. The estimation of the latter parameter is performed here by employing the recent adaptive observer scheme of Besancon et al., but applied in a nonstandard form in which a time-varying quantity containing the unknown Riccati parameter is estimated first. Results of computer simulations are presented to illustrate the good feasibility of this approach for a case in which the estimation is not easily accomplished by other meansComment: 8 pages, 6 figure

Presenting in Virtual Worlds: An Architecture for a 3D Anthropomorphic Presenter

Multiparty-interaction technology is changing entertainment, education, and training. Deployed examples of such technology include embodied agents and robots that act as a museum guide, a news presenter, a teacher, a receptionist, or someone trying to sell you insurance, homes, or tickets. In all these cases, the embodied agent needs to explain and describe. This article describes the design of a 3D virtual presenter that uses different output channels (including speech and animation of posture, pointing, and involuntary movements) to present and explain. The behavior is scripted and synchronized with a 2D display containing associated text and regions (slides, drawings, and paintings) at which the presenter can point. This article is part of a special issue on interactive entertainment

On Languages Accepted by P/T Systems Composed of joins

Recently, some studies linked the computational power of abstract computing systems based on multiset rewriting to models of Petri nets and the computation power of these nets to their topology. In turn, the computational power of these abstract computing devices can be understood by just looking at their topology, that is, information flow. Here we continue this line of research introducing J languages and proving that they can be accepted by place/transition systems whose underlying net is composed only of joins. Moreover, we investigate how J languages relate to other families of formal languages. In particular, we show that every J language can be accepted by a log n space-bounded non-deterministic Turing machine with a one-way read-only input. We also show that every J language has a semilinear Parikh map and that J languages and context-free languages (CFLs) are incomparable

Asynchronous spiking neural P systems

We consider here spiking neural P systems with a non-synchronized (i.e., asynchronous) use of rules: in any step, a neuron can apply or not apply its rules which are enabled by the number of spikes it contains (further spikes can come, thus changing the rules enabled in the next step). Because the time between two firings of the output neuron is now irrelevant, the result of a computation is the number of spikes sent out by the system, not the distance between certain spikes leaving the system. The additional non-determinism introduced in the functioning of the system by the non-synchronization is proved not to decrease the computing power in the case of using extended rules (several spikes can be produced by a rule). That is, we obtain again the equivalence with Turing machines (interpreted as generators of sets of (vectors of) numbers). However, this problem remains open for the case of standard spiking neural P systems, whose rules can only produce one spike. On the other hand we prove that asynchronous systems, with extended rules, and where each neuron is either bounded or unbounded, are not computationally complete. For these systems, the configuration reachability, membership (in terms of generated vectors), emptiness, infiniteness, and disjointness problems are shown to be decidable. However, containment and equivalence are undecidable. © 2009 Elsevier B.V. All rights reserved

The Brightest Cluster Galaxy in Abell 85: The Largest Core Known so far

We have found that the brightest cluster galaxy (BCG) in Abell~85, Holm 15A, displays the largest core so far known. Its cusp radius, $r_{\gamma} = 4.57 \pm 0.06$ kpc ($4.26^{\prime\prime}\pm 0.06^{\prime\prime}$), is more than 18 times larger than the mean for BCGs, and $\geq1$ kpc larger than A2261-BCG, hitherto the largest-cored BCG (Postman, Lauer, Donahue, et al. 2012) Holm 15A hosts the luminous amorphous radio source 0039-095B and has the optical signature of a LINER. Scaling laws indicate that this core could host a supermassive black hole (SMBH) of mass $M_{\bullet}\thicksim (10^{9}-10^{11})\,M_{\odot}$. We suggest that cores this large represent a relatively short phase in the evolution of BCGs, whereas the masses of their associated SBMH might be set by initial conditions.Comment: 14 pages, 3 figure, 2 tables, accepted for publication in ApJ Letters on October 6th, 2014, replacement of previous manuscript submitted on May 30th, 2014 to astro-p

Brownian dynamics simulation of DNA condensation.

DNA condensation observed in vitro with the addition of polyvalent counterions is due to intermolecular attractive forces. We introduce a quantitative model of these forces in a Brownian dynamics simulation in addition to a standard mean-field Poisson-Boltzmann repulsion. The comparison of a theoretical value of the effective diameter calculated from the second virial coefficient in cylindrical geometry with some experimental results allows a quantitative evaluation of the one-parameter attractive potential. We show afterward that with a sufficient concentration of divalent salt (typically approximately 20 mM MgCl(2)), supercoiled DNA adopts a collapsed form where opposing segments of interwound regions present zones of lateral contact. However, under the same conditions the same plasmid without torsional stress does not collapse. The condensed molecules present coexisting open and collapsed plectonemic regions. Furthermore, simulations show that circular DNA in 50% methanol solutions with 20 mM MgCl(2) aggregates without the requirement of torsional energy. This confirms known experimental results. Finally, a simulated DNA molecule confined in a box of variable size also presents some local collapsed zones in 20 mM MgCl(2) above a critical concentration of the DNA. Conformational entropy reduction obtained either by supercoiling or by confinement seems thus to play a crucial role in all forms of condensation of DNA

A matter of taste: the adverse effect of pollen compounds on the pre-ingestive gustatory experience of sugar solutions for honeybees

This is the final version. Available from the publisher via the DOI in this record.The online version of this article (https://doi.org/10.1007/s00359-019-01347-z) contains supplementary material, which is available to authorized users.In addition to sugars, nectar contains multiple nutrient compounds in varying concentrations yet little is known of their effect on the reward properties of nectar and the resulting implications for insect behaviour. We examined the pre-ingestive responses of honeybees to sucrose solutions containing a mix of pollen compounds, the amino acids proline or phenylalanine, or known distasteful substances, quinine and salt. We predicted that in taste and learning assays, bees would respond positively to the presence of nutrient compounds in a sucrose solution. However, bees’ proboscis extension responses decreased when their antennae were stimulated with pollen- or amino-acid supplemented sucrose solutions. Compared to pure sucrose, bees exhibited worse acquisition when conditioned to an odour with pollen-supplemented sucrose as the unconditioned stimulus. Such learning impairment was also observed with quinine-containing sucrose solutions. Our results suggest that bees can use their antennae to detect pollen compounds in floral nectars. Depending on the type and concentrations of compounds present, this may result in nectar being perceived as distasteful by bees, making it less effective in reinforcing the learning of floral cues. Such reward devaluation might be adaptive in cases where plants benefit from regulating the frequency of bee visitation.UKIERI (British Council)Biotechnology and Biological Sciences Research Council (BBSRC) (SWBiosciences DTP